منابع مشابه
Doomsday Equilibria for Omega-Regular Games
Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games. In this paper we propose a...
متن کاملDoomsday Equilibria for Games on Graphs∗
Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games. In this paper we propose a...
متن کاملConcurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider omega-regular winning conditions on the resulting infinite state sequence. To model the independe...
متن کاملGames with lexicographically ordered $\omega$-regular objectives
In recent years, two-player zero-sum games with multidimensional objectives have received a lot of interest as a model for the synthesis of complex reactive systems. In this framework, player 1 wins if he can ensure that all objectives are satisfied against any behavior of player 2. It is however often natural to provide more significance to one objective over another, a situation that can be m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2016.10.012